Makespan optimization using Timed Petri Nets and Mixed Integer Linear Programming Problem
نویسندگان
چکیده
منابع مشابه
Trajectory Optimization using Mixed-Integer Linear Programming
This thesis presents methods for finding optimal trajectories for vehicles subjected to avoidance and assignment requirements. The former include avoidance of collisions with obstacles or other vehicles and avoidance of thruster plumes from spacecraft. Assignment refers to the inclusion of decisions about terminal constraints in the optimization, such as assignment of waypoints to UAVs and the ...
متن کاملOptimization of Timed Automata Models Using Mixed-Integer Programming
Research on optimization of timed systems, as e.g. for computing optimal schedules of manufacturing processes, has lead to approaches that mainly fall into the following two categories: On one side, mixed integer programming (MIP) techniques have been developed to successfully solve scheduling problems of moderate to medium size. On the other side, reachability algorithms extended by the evalua...
متن کاملMixed-integer linear programming heuristics for the prepack optimization problem
In this paper we consider a packing problem arising in inventory allocation applications, where the operational cost for packing the bins is comparable, or even higher, than the cost of the bins (and of the items) themselves. This is the case, for example, of warehouses that have to manage a large number of different customers (e.g., stores), each requiring a given set of items. For this proble...
متن کاملOn K-diagnosability of Petri nets via integer linear programming
This paper deals with the problem of diagnosability of a fault after the firing of a finite number events (i.e., K-diagnosability). This problemcorresponds to diagnosability of a faultwithin a finite delay in the context of discrete event systems. The main contribution of this paper is a necessary and sufficient condition for K-diagnosability of bounded nets. The proposed approach exploits the ...
متن کاملIncremental Integer Linear Programming Models for Petri Nets Reachability Problems
The operational management of complex systems is characterized, in general, by the existence of a huge number of solutions. Decision-making processes must be implemented in order to find the best results. These processes need suitable modeling tools offering true practical resolution perspectives. Among them, Petri nets (PNs) provide a simple graphical model taking into account, in the same for...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IFAC-PapersOnLine
سال: 2020
ISSN: 2405-8963
DOI: 10.1016/j.ifacol.2021.04.073